Parallelization Strategies for the Ant System
نویسنده
چکیده
The Ant System is a new meta heuristic method particularly appropriate to solve hard combinatorial optimization problems It is a population based nature inspired approach exploiting positive feedback as well as local information and has been applied successfully to a variety of combinatorial optimization problems The Ant System consists of a set of cooperating agents arti cial ants and a set of rules that determine the generation update and usage of local and global information in order to nd good solutions As the structure of the Ant System highly suggests a parallel implementation of the algorithm in this paper two parallelization strategies for an Ant System implementation are developed and evaluated the synchronous parallel algorithm and the partially asynchronous parallel algorithm Using the Trav eling Salesman Problem a discrete event simulation is performed and both strategies are evaluated on the criteria speedup e ciency and e cacy Finally further improvements for an advanced parallel implementation are discussed
منابع مشابه
Parallelization Strategies for Ant Colony Optimization
Ant Colony Optimization (ACO) is a new population oriented search metaphor that has been successfully applied toNP-hard combinatorial optimization problems. In this paper we discuss parallelization strategies for Ant Colony Optimization algorithms. We empirically test the most simple strategy, that of executing parallel independent runs of an algorithm. The empirical tests are performed applyin...
متن کاملParallel Ant Colony Optimization on Graphics Processing Units
The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic on Graphics Processing Units (GPUs). The Max–Min Ant System (MMAS) algorithm augmented with 3-opt local search is used as a framework for the implementation of the parallel ants and multiple ant colonies general parallelization approaches. The four resulting GPU algor...
متن کاملComparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implementation. Our aim is to show that the shared memory approach is a competitive strategy for the parallelization of ACO algorithms. The sequential ACO algorithm on which are based both parallelization schemes is first des...
متن کاملCandidate Set Parallelization Strategies for Ant Colony Optimization on the GPU
For solving large instances of the Travelling Salesman Problem (TSP), the use of a candidate set (or candidate list) is essential to limit the search space and reduce the overall execution time when using heuristic search methods such as Ant Colony Optimisation (ACO). Recent contributions have implemented ACO in parallel on the Graphics Processing Unit (GPU) using NVIDIA CUDA but struggle to ma...
متن کاملParallel Ant Colony Optimization Algorithm on a Multi-core Processor
This paper proposes parallelization methods of ACO algorithms on a computing platform with a multi-core processor aiming at fast execution to find acceptable solutions. As an ACO algorithm, we use the cunning Ant System and test on several sizes of TSP instances. As the parallelization method, we use agent level parallelization in one colony using Java thread programming. According to the synch...
متن کامل